Locally stable sets with minimum cardinality

نویسندگان

چکیده

The nonlocal set has received wide attention over recent years. Shortly before, Li and Wang arXiv:2202.09034 proposed the concept of a locally stable set: only possible orthogonality preserving measurement on each subsystem is trivial. Locally sets present stronger nonlocality than those that are just indistinguishable. In this work, we focus constructions in multipartite quantum systems. First, two lemmas put forward to prove an orthogonality-preserving local must be Then with minimum cardinality bipartite systems ${\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}\phantom{\rule{4pt}{0ex}}(d\ensuremath{\ge}3)$ ${\mathbb{C}}^{{d}_{1}}\ensuremath{\bigotimes}{\mathbb{C}}^{{d}_{2}}\phantom{\rule{4pt}{0ex}}(3\ensuremath{\le}{d}_{1}\ensuremath{\le}{d}_{2})$. Moreover, for ${({\mathbb{C}}^{d})}^{\ensuremath{\bigotimes}n}\phantom{\rule{4pt}{0ex}}(d\ensuremath{\ge}2)$ ${\ensuremath{\bigotimes}}_{i=1}^{n}{\mathbb{C}}^{{d}_{i}}\phantom{\rule{4pt}{0ex}}(3\ensuremath{\le}{d}_{1}\ensuremath{\le}{d}_{2}\ensuremath{\le}\ensuremath{\cdots}\ensuremath{\le}{d}_{n})$, also obtain $d+1$ ${d}_{n}+1$ orthogonal states, respectively. Fortunately, our reach lower bound sets, which provides positive complete answer open problem raised arXiv:2202.09034.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

We consider the case of multistage stochastic programming, in which decisions can adapt over time (i.e. at each stage) in response to observation of one or more random variables (uncertain parameters) and the time at which each observation occurs is decision-dependent. This is the difficult case of stochastic programming with endogeneous observation of uncertainty. Although such stochastic prog...

متن کامل

Cardinality for Infinite Sets

How can we determine whether two sets have the same cardinality (or “size”)? The answer to this question, reassuringly, lies in early grade school memories: by demonstrating a pairing between elements of the two sets. More formally, we need to demonstrate a bijection f between the two sets. The bijection sets up a one-to-one correspondence, or pairing, between elements of the two sets. We know ...

متن کامل

Polynomial Constraints for Sets with Cardinality Bounds

Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents a class of constraints on sets and their cardinalities for which the satisfiability and the entailment problems are computable in polynomial time. Our class of constraints, based on tree-shaped formulas, is unique in being simul...

متن کامل

Some Generalizations of Locally Closed Sets

Arenas et al. [1] introduced the notion of lambda-closed sets as a generalization of locally closed sets. In this paper, we introduce the notions of lambda-locally closed sets, Lambda_lambda-closed sets and lambda_g-closed sets and obtain some decompositions of closed sets and continuity in topological spaces.

متن کامل

On Cardinality of Fuzzy Sets

In this article, we would like to revisit and comment on the widely used definition of cardinality of fuzzy sets. For this purpose we have given a brief description of the history of development of fuzzy cardinality. In the process, we can find that the existing definition fails to give a proper cardinality while dealing with complementation of fuzzy sets. So there arises the need of defining t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2023

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physreva.108.012418